On the spread of the spectrum of a graph

نویسندگان

Bolian Liu

Muhuo Liu

چکیده

Upper and lower bounds are obtained for the spread 1 n of the eigenvalues 1 2 n of the adjacency matrix of a simple graph. MSC: 05C50, 15A42; 15A36

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Laplacian Energy of a Fuzzy Graph

A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...

متن کامل

Survey of Graph Energies

Let graph energy is a graph--spectrum--based quantity‎, ‎introduced in the 1970s‎. ‎After a latent period of 20--30 years‎, ‎it became a popular topic of research both‎ ‎in mathematical chemistry and in ``pure'' spectral graph theory‎, ‎resulting in‎ ‎over 600 published papers‎. ‎Eventually‎, ‎scores of different graph energies have‎ ‎been conceived‎. ‎In this article we...

متن کامل

The spectrum of the hyper-star graphs and their line graphs

Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...

متن کامل

ON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS

A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...

متن کامل

Characterizations of the simple group $D_{n}(3)$ by prime graph and spectrum

We prove that $D_n(3)$, where $ngeq6$ is even, is uniquely determined by its prime graph. Also, if $G$ is a finite group with the same prime graph as $D_4(3)$, then $Gcong D_4(3), B_3(3), C_3(3)$ or $G/O_2(G)cong {rm Aut}({}^2B_2(8))$.

متن کامل